Information and Coding Discrimination of Pseudo-Additive Entropies (PAE)

نویسنده

  • B. H. Lavenda
چکیده

PAE cannot be made a basis for either a generalized statistical mechanics or a generalized information theory. Either statistical independence must be waived, or the expression of the averaged conditional probability as the difference between the marginal and joint entropies must be relinquished. The same inequality, relating the PAE to the Rényi entropy, when applied to the mean code length produces an expression that it is without bound as the order of the code length approaches infinity. Since the mean code length associated with the Rényi entropy is finite and can be made to come as close to the Hartley entropy as desired in the same limit, the PAE have a more limited range of validity than the Rényi entropy which they approximate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive Entropies of degree-q and the Tsallis Entropy

The Tsallis entropy is shown to be an additive entropy of degree-q that information scientists have been using for almost forty years. Neither is it a unique solution to the nonadditive functional equation from which random entropies are derived. Notions of additivity, extensivity and homogeneity are clarified. The relation between mean code lengths in coding theory and various expressions for ...

متن کامل

On the Uniqueness Theorem for Pseudo-Additive Entropies

The aim of this paper is to show that the Tsallis-type (q-additive) entropic chain rule allows for a wider class of entropic functionals than previously thought. In particular, we point out that the ensuing entropy solutions (e.g., Tsallis entropy) can be determined uniquely only when one fixes the prescription for handling conditional entropies. By using the concept of Kolmogorov–Nagumo quasi-...

متن کامل

Stationary and dynamical properties of information entropies in nonextensive systems.

The Tsallis entropy and Fisher information entropy (matrix) are very important quantities expressing information measures in nonextensive systems. Stationary and dynamical properties of the information entropies have been investigated in the N -unit coupled Langevin model subjected to additive and multiplicative white noise, which is one of typical nonextensive systems. We have made detailed, a...

متن کامل

Comparison of Entropies in the Light of Separability

We introduce an entropy of the form −Tr(ρnlogρ) to investigate quantum mechanical properties, like entanglement, for mixed states. We compare it to other quantum entropies where the power of the density matrix has been used to obtain more information than the Von Neumann entropy. We discuss both the pure state case and the mixed state case (Werner state) with special regard to separability. The...

متن کامل

Inferring degree of nonextensivity for generalized entropies

The purpose of this note is to argue that degree of nonextensivity as given by the Tsallis distribution obtained from maximum entropy principle has a different origin than the nonextensivity inferred from pseudo-additive property of Tsallis entropy. PACS: 05.20.-y, 05.30.-d

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Open Syst. Inform. Dynam.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2004